Generic Minimizing Behavior in Semialgebraic Optimization

نویسندگان

  • Dmitriy Drusvyatskiy
  • Alexander D. Ioffe
  • Adrian S. Lewis
چکیده

We present a theorem of Sard type for semi-algebraic set-valued mappings whose graphs have dimension no larger than that of their range space: the inverse of such a mapping admits a single-valued analytic localization around any pair in the graph, for a generic value parameter. This simple result yields a transparent and unified treatment of generic properties of semi-algebraic optimization problems: “typical” semi-algebraic problems have finitely many critical points, around each of which they admit a unique “active manifold” (analogue of an active set in nonlinear optimization); moreover, such critical points satisfy strict complementarity and second-order sufficient conditions for optimality are indeed necessary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic Optimality Conditions for Semialgebraic Convex Programs

We consider linear optimization over a nonempty convex semialgebraic feasible region F . Semidefinite programming is an example. If F is compact, then for almost every linear objective there is a unique optimal solution, lying on a unique “active” manifold, around which F is “partly smooth,” and the second-order sufficient conditions hold. Perturbing the objective results in smooth variation of...

متن کامل

Optimization of Polynomials on Compact Semialgebraic Sets

A basic closed semialgebraic subset S of Rn is defined by simultaneous polynomial inequalities g1 ≥ 0, . . . , gm ≥ 0. We give a short introduction to Lasserre’s method for minimizing a polynomial f on a compact set S of this kind. It consists of successively solving tighter and tighter convex relaxations of this problem which can be formulated as semidefinite programs. We give a new short proo...

متن کامل

Generic Properties for Semialgebraic Programs

In this paper we study genericity for the following parameterized class of nonlinear programs: minimize fu(x) := f(x)− 〈u, x〉 subject to x ∈ S, where f : R → R is a polynomial function and S ⊂ R is a closed semialgebraic set, which is not necessarily compact. Assume that the constraint set S is regular. It is shown that there exists an open and dense semialgebraic set U ⊂ R such that for any ū ...

متن کامل

Minimizing Polynomials Over Semialgebraic Sets

This paper concerns a method for finding the minimum of a polynomial on a semialgebraic set, i.e., a set in R defined by finitely many polynomial equations and inequalities, using the Karush-Kuhn-Tucker (KKT) system and sum of squares (SOS) relaxations. This generalizes results in the recent paper [15], which considers minimizing polynomials on algebraic sets, i.e., sets in R defined by finitel...

متن کامل

Minimizing the sum of many rational functions

We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of variables can be large (10 to 100) provided some kind of sparsity is present. We describe a formulation of the rational optimization problem as a generalized m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2016